Interpolation and Approximation from Convex Sets
نویسندگان
چکیده
Let X be a topological vector space, Y = IR n , n 2 IN, A a continuous linear map from X to Y , C X, B a convex set dense in C, and d 2 Y a data point. We derive conditions which guarantee that the set B \ A ?1 (d) is nonempty and dense in C \ A ?1 (d). Some applications to shape preserving interpolation and approximation are described.
منابع مشابه
Approximation of Univariate Set-Valued Functions- an Overview
The paper is an updated survey of our work on the approximation of univariate setvalued functions by samples-based linear approximation operators, beyond the results reported in our previous overview. Our approach is to adapt operators for real-valued functions to set-valued functions, by replacing operations between numbers by operations between sets. For set-valued functions with compact conv...
متن کاملInterpolation and Approximation from Convex Sets II. In nite-Dimensional Interpolation
Let X and Y be topological vector spaces, A be a continuous linear map from X to Y , C X, B be a convex set dense in C, and d 2 Y be a data point. Conditions are derived guaranteeing the set B \ A ?1 (d) to be nonempty and dense in C \ A ?1 (d). The paper generalizes earlier results by the authors to the case where Y is innnite dimensional. The theory is illustrated with two examples concerning...
متن کاملSet-valued Hermite interpolation
The problem of interpolating a set-valued function with convex images is addressed by means of directed sets. A directed set will be visualised as a usually non-convex set in Rn consisting of three parts together with its normal directions: the convex, the concave and the mixed-type part. In the Banach space of the directed sets, a mapping resembling the Kergin map is established. The interpola...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملSubdivision Schemes of Sets and the Approximation of Set-Valued Functions in the Symmetric Difference Metric
Approximation of set-valued functions (SVFs) has various potential applications in optimization, control theory, mathematical economics, medical imaging and more. The problem is closely related to the approximation of an N -dimensional object from a sequence of its parallel cross-sections, since such an object can be regarded as a univariate set-valued function with sets of dimension N − 1 as i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998